Randomness criteria in binary visibility graph perspective

摘要

By means of a binary visibility graph, we present a novel method to studyrandom binary sequences. The behavior of the some topological properties of thebinary visibility graph, such as the degree distribution, the clusteringcoefficient, and the mean path length have been investigated. Several examplesare then provided to show that the numerical simulations confirm the accuracyof the theorems for finite random binary sequences. Finally, in this paper wepropose, for the first time, three topological properties of the binaryvisibility graph as a randomness criteria.